Top-down induction of model trees with regression and splitting nodes
نویسندگان
چکیده
منابع مشابه
Mining Model Trees with Regression and Splitting Nodes
Model trees are tree-based models that associate leaves with multiple linear models and are used to solve prediction problems in which the response variable is numeric. In this paper a method for mining model trees is presented. Its main characteristic is the construction of trees with two types of nodes: regression nodes, which perform only straight-line regression, and splitting nodes, which ...
متن کاملSimplification Methods for Model Trees with Regression and Splitting Nodes
Model trees are tree-based regression models that associate leaves with linear regression models. A new method for the stepwise induction of model trees (SMOTI) has been developed. Its main characteristic is the construction of trees with two types of nodes: regression nodes, which perform only straight-line regression, and splitting nodes, which partition the feature space. In this way, intern...
متن کاملSimplifying Model Trees with Regression and Splitting Nodes
Model trees are tree-based regression models that associate leaves with linear regression models. A new method for the stepwise induction of model trees (SMOTI) has been developed. Its main characteristic is the construction of trees with two types of nodes: regression nodes, which perform only straight-line regression, and splitting nodes, which partition the feature space. In this way, intern...
متن کاملTop-Down Induction of Clustering Trees
An approach to clustering is presented that adapts the basic top-down induction of decision trees method towards clustering. To this aim, it employs the principles of instance based learning. The resulting methodology is implemented in the TIC (Top down Induction of Clustering trees) system for first order clustering. The TIC system employs the first order logical decision tree representation o...
متن کاملTop-down induction of logical decision trees
Top-down induction of decison trees (TDIDT) is a very popular machine learning technique. Up till now, it has mainly used for propositional learning, but seldomly for relational learning or inductive logic programming. The main contribution of this paper is the introduction of logic decision trees, which make it possible to use TDIDT in inductive logic programming. An implementation of this top...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2004
ISSN: 0162-8828
DOI: 10.1109/tpami.2004.1273937